/****************
*PID:uva10934
*Auth:Jonariguez
*****************
*/
#define lson k*2,l,m
#define rson k*2+1,m+1,r
#define rep(i,s,e) for(i=(s);i<=(e);i++)
#define For(j,s,e) For(j=(s);j<(e);j++)
#define sc(x) scanf("%d",&x)
#define In(x) scanf("%I64d",&x)
#define pf(x) printf("%d",x)
#define pfn(x) printf("%d\n",(x))
#define Pf(x) printf("%I64d",(x))
#define Pfn(x) printf("%I64d\n",(x))
#define Pc printf(" ")
#define PY puts("YES")
#define PN puts("NO")
#include <stdio.h>
#include <string.h>
#include <string>
#include <math.h>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
typedef unsigned long long LL;
typedef int Ll;
Ll quick_pow(Ll a,Ll b,Ll MOD){a%=MOD;Ll res=1;while(b){if(b&1)res=(res*a)%MOD;b/=2;a=(a*a)%MOD;}return res;}

const int maxn=100000+10;
LL dp[110][65];

int main()
{
    int i,j,k;
    LL n;
    for(i=1;i<=100;i++){
        for(j=1;j<64;j++){
            dp[i][j]=dp[i-1][j-1]+1+dp[i][j-1];
        }
    }
    while(scanf("%d%llu",&k,&n)){
        if(k==0) break;
        bool ok=false;
        for(i=1;i<64;i++){
            if(dp[k][i]>=n){
                printf("%d\n",i);
                ok=true;break;
            }
        }
        if(!ok)
            puts("More than 63 trials needed.");
    }
    return 0;
}



